Near Isometric Terminal Embeddings for Doubling Metrics

نویسندگان

چکیده

Given a metric space (X, d), set of terminals $$K\subseteq X$$ , and parameter $$0<\epsilon <1$$ we consider structures (e.g., spanners, distance oracles, embedding into normed spaces) that preserve distances for all pairs in $$K\times up to factor $$1+\epsilon$$ have small size (e.g. number edges dimension embeddings). While such terminal (aka source-wise) are known exist several settings, no spanner or with distortion close 1, is currently known. Here devise doubling metrics, show essentially any structure s(|X|) has its counterpart, $$1+O(\epsilon )$$ $$s(|K|)+n$$ . In particular, on n points, k terminals, constant there exists Moreover, surprisingly, the last two results apply if only K doubling, while X can be arbitrary.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Near Isometric Terminal Embeddings for Doubling Metrics

Given a metric space (X, d), a set of terminals K ⊆ X , and a parameter t ≥ 1, we consider metric structures (e.g., spanners, distance oracles, embedding into normed spaces) that preserve distances for all pairs inK ×X up to a factor of t, and have small size (e.g. number of edges for spanners, dimension for embeddings). While such terminal (aka source-wise) metric structures are known to exist...

متن کامل

A Convex Approach for Learning Near-Isometric Linear Embeddings

We propose a novel framework for the deterministic construction of linear, near-isometric embeddings of a finite set of data points. Given a set of training points X ⊂ R , we consider the secant set S(X ) that consists of all pairwise difference vectors of X , normalized to lie on the unit sphere. We formulate an affine rank minimization problem to construct a matrix Ψ that preserves the norms ...

متن کامل

Practical Algorithms for Learning Near-Isometric Linear Embeddings

We propose two practical non-convex approaches for learning near-isometric, linear embeddings of finite sets of data points. Following Hegde, et. al. [6], given a set of training points X , we consider the secant set S(X ) that consists of all pairwise difference vectors of X , normalized to lie on the unit sphere. The problem can be formulated as finding a symmetric and positive semidefinite m...

متن کامل

Isometric Embeddings, Einstein Metrics and Extension of Isometries

We prove that continuous groups of isometries at a compact boundary (∂M, γ) extend to continuous groups of isometries of any Einstein filling manifold (M, g) provided, for instance, π1(M,∂M) = 0.

متن کامل

Upper Bound for Isometric Embeddings

The isometric embeddings 2;K → p;K (m ≥ 2, p ∈ 2N) over a field K ∈ {R,C,H} are considered, and an upper bound for the minimal n is proved. In the commutative case (K = H) the bound was obtained by Delbaen, Jarchow and Pe lczyński (1998) in a different way. Let K be one of three fields R,C,H (real, complex or quaternion). Let K be the K-linear space consisting of columns x = [ξi] n 1 , ξi ∈ K, ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Algorithmica

سال: 2021

ISSN: ['1432-0541', '0178-4617']

DOI: https://doi.org/10.1007/s00453-021-00843-6